Multi - Capacity Bin Packing
نویسندگان
چکیده
منابع مشابه
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting jobs; the processing node. A job was allocated the minimum number of nodes required to meet its largest resource requirement (e.g. memory, CPUs, I/O channels, etc.). Single capacity bin-packing algorithms were applied to ...
متن کاملAn iterated local search heuristic for multi-capacity bin packing and machine reassignment problems
This paper proposes an efficient Multi-Start Iterated Local Search (MS-ILS) metaheuristic for Multi-Capacity Bin Packing Problems (MCBPP) and Machine Reassignment Problems (MRP). The MCBPP is a generalization of the classical bin-packing problem in which the machine (bin) capacity and task (item) sizes are given by multiple (resource) dimensions. The MRP is a challenging and novel optimization ...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملSolving the Multi-Resource Bin Packing Problem with a Reordering Grouping Genetic Algorithm
We formally define multi-resource bin packing, a generalization of conventional bin packing, and develop an algorithm called Reordering Grouping Genetic Algorithm (RGGA) to solve this problem. Multi-resource bin packing can be applied to different problems, such as placing virtual machines onto servers. We first test RGGA on conventional bin packing problems and show that it yields excellent re...
متن کاملThe Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of capacity B with C compartments, and n items of Q different classes, each item i ∈ {1, . . . , n} with class ci and size si. The problem is to pack the items into bins, where each bin contains at most C different class...
متن کامل